Covering lemmas revisited

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Covering based Rough Sets Revisited

In this paper we review four fuzzy extensions of the socalled tight pair of covering based rough set approximation operators. Furthermore, we propose two new extensions of the tight pair: for the first model, we apply the technique of representation by levels to define the approximation operators, while the second model is an intuitive extension of the crisp operators. For the six models, we st...

متن کامل

Covering Lemmas and an Application to Nodal Geometry on Riemannian Manifolds

The main part of this note is to show a general covering lemma in Rn, n 2 2 , with the aim to obtain the estimate for BMO norm and the volume of a nodal set of eigenfunctions on Riemannian manifolds. This article is a continuation of our previous work [L]. In [L] we proved a covering lemma in R2 and applied it to the BMO norm estimates for eigenfunctions on Riemannian surfaces. The principal pa...

متن کامل

Covering Groups of Non-connected Topological Groups Revisited

All spaces are assumed to be locally path connected and semi-locally 1-connected. Let X be a connected topological group with identity e, and let p : X̃ → X be the universal cover of the underlying space of X. It follows easily from classical properties of lifting maps to covering spaces that for any point ẽ in X̃ with pẽ = e there is a unique structure of topological group on X̃ such that ẽ is th...

متن کامل

Covering a sphere with caps: Rogers bound revisited

We consider coverings of a sphere Sn r of radius r with the balls of radius one in an n-dimensional Euclidean space R. Our goal is to minimize the covering density, which defines the average number of the balls covering a point in Sn r . For a growing dimension n, we obtain the covering density at most (n lnn)/2 for any sphere Sn r and the entire space R. This new upper bound reduces two times ...

متن کامل

Decomposition Lemmas

We define the following recursive function T (n): T (0) = 0 T (1) = 0 T (2) = 1 T (n) = T n 2 + T n 2 + 1 + T n 2 − 1 + T n 2 + 1 (1.1) (n ≥ 3).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1988

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500006647